Obsessional Experiments For Linear Logic Proof-Nets
نویسنده
چکیده
منابع مشابه
On the relation between coherence semantics and multiplicative proof nets
It is known that (mix) proof nets admit a coherence semantics, computed as a set of experiments. We prove here the converse: a proof structure is shown to be a proof net whenever its set of experiments is a semantical object — a clique of the corresponding coherence space. Moreover the interpretation of atomic formulae can be restricted to a given coherent space with four tokens in its web. Thi...
متن کاملPlanar and braided proof-nets for multiplicative linear logic with mix
We consider a class of graphs embedded in R2 as noncommutative proof-nets with an explicit exchange rule. We give two characterization of such proof-nets, one representing proof-nets as CW-complexes in a two-dimensional disc, the other extending a characterization by Asperti. As a corollary, we obtain that the test of correctness in the case of planar graphs is linear in the size of the data. B...
متن کاملDefeasible Inheritance Networks and Linear Logic: Horn Fragments and Proof Nets
Based on a remark of Girard (1992) and a formalization given by Fouqueré and Vauzeilles (1994), we investigate a formalization of defeasible inheritance reasoning in terms of linear logic. We show a correspondence between defeasible inheritance networks, a Horn fragment of linear logic, and proof nets for linear logic. In particular, we show a structural correspondence between defeasible inheri...
متن کاملRetractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof nets, that is a correctness criterion (an algorithm) for checking those proof structures which correspond to proofs of the purely multiplicative and additive fragment of linear logic. This criterion is formulated in t...
متن کاملProof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abstract representation of cut-free proofs modulo inessential commutations of rules. The only known extension to additives, based on monomial weights, fails to preserve this key feature: a host of cut-free monomial proof nets can correspond to the same cut-free proof. Thus the problem of finding a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 13 شماره
صفحات -
تاریخ انتشار 2003